Polymorphic queries for P2P systems
نویسندگان
چکیده
منابع مشابه
Polymorphic queries for P2P systems
When a query is posed on a centralized database, if it refers to attributes that are not defined in the database, the user is warranted to get either an error or an empty set. In contrast, when a query is posed on a peer in a P2P system and refers to attributes not found in the local database, the query should not be simply rejected if the relevant information is available at other peers. This ...
متن کاملJoin queries in P2P DHT Systems
P2P systems based on Distributed Hash Tables are certainly an important category of massively distributed systems. However, it is necessary to improve the query language to use these systems in different applicative contexts. This article presents strategies for evaluating natural and equality joins using the indexes available in the system to reduce the number of peers contacted in the query e...
متن کاملProcessing Rank-Aware Queries in P2P Systems
Efficient query processing in P2P systems poses a variety of challenges. As a special problem in this context we consider the evaluation of rank-aware queries, namely top-N and skyline, on structured data. The optimization of query processing in a distributed manner at each peer requires locally available statistics. In this paper, we address this problem by presenting approaches relying on the...
متن کاملProcessing Skyline Queries in P2P Systems
Efficient query processing in P2P systems poses a variety of challenges mainly resulting from the strict decentralization and limited knowledge. Particularly with regard to queries involving ranking, top-N or skylines, existing approaches for centralized systems cannot be applied easily to P2P environments. In this paper, we focus on the problem of efficiently processing skyline queries in larg...
متن کاملAnswering Constrained k-NN Queries in Unstructured P2P Systems
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2011
ISSN: 0306-4379
DOI: 10.1016/j.is.2011.01.001